Hardy's inequality and ultrametric matrices

Assessing Congruence Among Ultrametric Distance Matrices

Recently, a test of congruence among distance matrices (CADM) has been developed. The null hypothesis is the incongruence among all data matrices. It has been shown that CADM has a correct type I error rate and good power when applied to independently-generated distance matrices. In this study, we investigate the suitability of CADM to compare ultrametric distance matrices. We tested the type I...

Inverse Young inequality in quaternion matrices

Inverse Young inequality asserts that if $nu >1$, then $|zw|ge nu|z|^{frac{1}{nu}}+(1-nu)|w|^{frac{1}{1-nu}}$, for all complex numbers $z$ and $w$, and equality holds if and only if $|z|^{frac{1}{nu}}=|w|^{frac{1}{1-nu}}$. In this paper the complex representation of quaternion matrices is applied to establish the inverse Young inequality for matrices of quaternions. Moreover, a necessary and ...

Refinements of Kantorovich Inequality for Hermitian Matrices

Inequality for p-norms of positive matrices

This paper derives an inequality relating the p-norm of a positive 2×2 block matrix to the p-norm of the 2×2 matrix obtained by replacing each block by its p-norm. The inequality had been known for integer values of p, so the main contribution here is the extension to all values p ≥ 1. In a special case the result reproduces Hanner’s inequality. As an application in quantum information theory, ...

An Inequality for Permanents of (0,1)-Matrices*

Let A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i = 1 ..... n, and let per(A) denote the permanent of A. Then per(A) ~< H ri q~/-2,.1 I + V T where equality can occur if and only if there exist permutation matrices P and Q such that PAQ is a direct sum of l-square and 2-square matrices all of whose entries are 1. I f A = (ai~) is an n-square mat r ix then the permanent ...